K.-M. Myhr svarer:

ABS-Type Methods for Solving $m$ Linear Equations in $frac{m}{k}$ Steps for $k=1,2,cdots,m$

‎The ABS methods‎, ‎introduced by Abaffy‎, ‎Broyden and Spedicato‎, ‎are‎‎direct iteration methods for solving a linear system where the‎‎$i$-th iteration satisfies the first $i$ equations‎, ‎therefore a‎ ‎system of $m$ equations is solved in at most $m$ steps‎. ‎In this‎‎paper‎, ‎we introduce a class of ABS-type methods for solving a full row‎‎rank linear equations‎, ‎w...

M M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...

K-regular Antichains on [m] with K ≤ M-2

Let 2 be ordered by set inclusion and let B ⊆ 2 be an antichain of size n := |B|. An antichain B is k-regular for some non-negative integer k, if for each i ∈ [m] there are exactly k sets B1, B2, . . . , Bk ∈ B containing i. In this case we say that B is a (k, m, n)-antichain. Let 2 ≤ k ≤ m − 2 be positive integers. In this paper we show that a (k, m, n)-antichain exists if and only if k + 1 ≤ ...

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

State Dependent M/M/C/K/N Machining System with Mixed Spares and Removable Repairmen